Cluster scheduling for real-time systems: utilization bounds and run-time overhead

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Run-Time Guarantees for Real-Time Systems

Interpretation (AI) • AI: semantics based method for static program analysis • Basic idea of AI: Perform the program's computations using value descriptions or abstract value in place of the concrete values • Basic idea in WCET: Derive timing information from an approximation of the “collecting semantics” (for all inputs) • AI supports correctness proofs • Tool support (PAG)

متن کامل

Instantaneous Utilization Based Scheduling Algorithms for Real Time Systems

This paper proposes a new novel scheduling algorithms to schedule periodic tasks for soft real time system. This is a planning based offline scheduler where tasks are scheduled on the basis of its instantaneous utilization. Here after every quantum of execution, instantaneous utilization of each task is calculated. Task which is having highest instantaneous utilization is scheduled to the proce...

متن کامل

Run-time monitoring of real-time systems

This paper presents a model and an implementation of a run-time environment for specifying and monitoringproperties of real-time systems. Theproposed approach supports annotating real-time programs with events that are recorded and examined at run-time. It provides two general methods for synchronous or asynchronous monitoring o f realtime constraints. In the synchronous case, a system constrai...

متن کامل

A Pre-Run-Time Scheduling Algorithm For Hard Real-Time Systems

In 1] a branch-and-bound implicit enumeration algorithm is described whose purpose is to generate a feasible schedule, if any, for each processor on a multiprocessing node running hard real-time processes. The optimization criterion is to minimize process lateness deened as the diierence between the process completion time and deadline. We show in this correspondence that this algorithm does no...

متن کامل

A pre-run-time scheduling algorithm for object-based distributed real-time systems

The most important goal in hard real-time systems is to guarantee that all timing constraints are satisfied. Even though object-based techniques (which contain reusable software components) are used to manage the complexity in the software development process of such systems, execution efficiency may have to be sacrificed, due to the large number of procedure calls and contention for accessing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Real-Time Systems

سال: 2011

ISSN: 0922-6443,1573-1383

DOI: 10.1007/s11241-011-9121-1